public class Solution {
    public int minCostClimbingStairs(int[] cost) {
        //1.创建dp表
        int n = cost.length;
        int[] dp = new int[n + 1];
        //2.初始化
        //3.填表
        for(int i = 2; i <= n; i++) {
            dp[i] = Math.min(dp[i - 1] + cost[ i - 1],dp[i - 2] + cost[i - 2]);
        }
        //4.返回值
        return dp[n];
    }

    public static void main(String[] args) {
        Solution solution = new Solution();
        int[] cost = {10,15,20};
        System.out.println(solution.minCostClimbingStairs(cost));
    }
}
